Upper bound for isometric embeddings $\ell _2^m\rightarrow \ell _p^n$
نویسندگان
چکیده
منابع مشابه
Upper Bound for Isometric Embeddings
The isometric embeddings 2;K → p;K (m ≥ 2, p ∈ 2N) over a field K ∈ {R,C,H} are considered, and an upper bound for the minimal n is proved. In the commutative case (K = H) the bound was obtained by Delbaen, Jarchow and Pe lczyński (1998) in a different way. Let K be one of three fields R,C,H (real, complex or quaternion). Let K be the K-linear space consisting of columns x = [ξi] n 1 , ξi ∈ K, ...
متن کاملA $2\ell k$ Kernel for $\ell$-Component Order Connectivity
In the `-Component Order Connectivity problem (` ∈ N), we are given a graph G on n vertices, m edges and a non-negative integer k and asks whether there exists a set of vertices S ⊆ V (G) such that |S| ≤ k and the size of the largest connected component in G−S is at most `. In this paper, we give a kernel for `-Component Order Connectivity with at most 2`k vertices that takes nO(`) time for eve...
متن کاملRethinking $(k,\ell)$-anonymity in social graphs: $(k,\ell)$-adjacency anonymity and $(k,\ell)$-(adjacency) anonymous transformations
This paper treats the privacy-preserving publication of social graphs in the presence of active adversaries, that is, adversaries with the ability to introduce sybil nodes in the graph prior to publication and leverage them to create unique fingerprints for a set of victim nodes and re-identify them after publication. Stemming from the notion of (k, l)-anonymity, we introduce (k, l)-anonymous t...
متن کاملELL-associated factor 2 (EAF2), a functional homolog of EAF1 with alternative ELL binding properties.
The (11;19)(q23;p13.1) translocation in acute leukemia results in the formation of an MLL-ELL fusion protein. ELL is an RNA polymerase II elongation factor that interacts with the recently identified EAF1 protein. To characterize the normal functions of ELL and its aberrant activities when fused to MLL, we isolated a second protein that interacts with ELL named EAF2 for ELL Associated Factor 2....
متن کاملLearning with $\ell^{0}$-Graph: $\ell^{0}$-Induced Sparse Subspace Clustering
ℓ 1-graph [19, 4], a sparse graph built by reconstructing each datum with all the other data using sparse representation , has been demonstrated to be effective in clustering high dimensional data and recovering independent subspaces from which the data are drawn. It is well known that ℓ 1-norm used in ℓ 1-graph is a convex relaxation of ℓ 0-norm for enforcing the sparsity. In order to handle g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 2008
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-08-09377-5